On Numerical Methods for Elliptic Transmission Eigenvalue Problems
نویسندگان
چکیده
The use of numerical tools to solve challenging problems in mathematics has exploded in the past several decades. The purpose of this paper is to compare the results of two different types of numerical methods in finding solutions to the eigenvalue problem for a second order elliptic partial differential equations (PDE) with boundary and transmission conditions. Transmission properties result from jumps in the coefficients of the equation and require more complex numerical methods to solve the eigenvalue problem than when the coefficients are continuous. We present the setup of both the bisection method to solve the exact equation satisfied by the eigenvalues and an application of the power method on a Finite Element Method discretization to find the largest eigenvalues and eigenfunction. We also provide some numerical evidence as to which method is more efficient given the complexities of our problem.
منابع مشابه
On Numerical Methods for Elliptic Transmission/boundary Value Problems
The use of numerical tools to solve challenging problems in mathematics has exploded in the past several decades. The purpose of this paper is to compare the results of two different types of numerical methods in finding solutions to the eigenvalue problem for a second-order elliptic differential equation subject to boundary and transmission conditions. The transmission conditions result from j...
متن کاملA convergent adaptive method for elliptic eigenvalue problems and numerical experiments
We prove the convergence of an adaptive linear finite element method for computing eigenvalues and eigenfunctions of second order symmetric elliptic partial differential operators. The weak form is assumed to yield a bilinear form which is bounded and coercive in H. Each step of the adaptive procedure refines elements in which a standard a posteriori error estimator is large and also refines el...
متن کاملA New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems
In this paper, two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS}) conjugate gradient method are presented to solve unconstrained optimization problems. A remarkable property of the proposed methods is that the search direction always satisfies the sufficient descent condition independent of line search method, based on eigenvalue analysis. The globa...
متن کاملCOMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERINGCommun
SUMMARY The computation of a few smallest eigenvalues of generalized algebraic eigenvalue problems is studied. The considered problems are obtained by discretizing self-adjoint second-order elliptic partial diierential eigenvalue problems in two-dimensional or three-dimensional domains. The standard Lanczos algorithm with the complete orthogonalization is used to compute some eigenvalues of the...
متن کاملSolving elliptic eigenvalue problems on polygonal meshes using discontinuous Galerkin composite finite element methods
In this paper we introduce a discontinuous Galerkin method on polygonal meshes. This method arises from the Discontinuous Galerkin Composite Finite Element Method (DGFEM) for source problems on domains with micro-structures. In the context of the present paper, the flexibility of DGFEM is applied to handle polygonal meshes. We prove the a priori convergence of the method for both eigenvalues an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011